Data Compression Issues with Pattern Matching in Historical Data

Effect of Data Compression on Pattern Matching in Historical Data

It is a common practice in the process industry to compress process data before it is archived. However, compression may alter the original data in a manner that makes extracting useful information from it more difficult. In this paper, popular data compression methods and their effect on pattern matching in historical data are evaluated. Pattern matching is performed using principal-component ...

Pattern Matching Image Compression: Algorithmic and Empirical Results

ÐWe propose a nontransform image compression scheme based on approximate one-dimensional pattern matching that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately occurs in the already processed image (e.g., in the sense o...

A New Compression Method for Compressed Matching

A practical adaptive compression algorithm based on LZSS is presented, which is especially constructed to solve the compressed pattern matching problem, i.e., pattern matching directly in a compressed text without decompressing.

Pattern Matching and Lossy Data Compression on Random Fields

Compressed Pattern Matching for Text

The amount of information that we are dealing with today is being generated at an everincreasing rate. On one hand, data compression is needed to efficiently store, organize the data and transport the data over the limited-bandwidth network. On the other hand, efficient information retrieval is needed to speedily find the relevant information from this huge mass of data using available resource...